Decision Diagram Optimization Using Copy Properties
نویسندگان
چکیده
In this paper, we propose an approach to the reduction of sizes of Multi-Terminal Binary Decision Diagrams (MTBDDs) [3] by using the copy properties of discrete functions. The underlying principles come from copy theory of discrete signals considered in [5, 6, 7]. We propose two modifications of MTBDDs, called Copy DDs (CDDs) and Half Copy DDs (HCDDs), using the corresponding copy operations from copy theory. Functions having different types of copy properties can be efficiently represented by the proposed Copy DDs. Examples are Walsh and Reed-Muller functions as well as different binary codes.
منابع مشابه
New multiplexer-based switching circuits synthesis methods
The work deals with the problem of methods of synthesis of switching circuits with multiplexers and it is mainly focused on optimization and reduction of these circuits. It analyses and describes the state of art in optimization and reduction methods of multiplexer trees and also contains description of the justification for the use of multiplexers in the switching circuits. We design a novel m...
متن کاملOptimization of Bdd by Chaotic Evolution Algorithm and Its Application in Test of Stuck- Open Faults in Digital Circuits
The binary decision diagram (BDD) is an efficient graph representation of logic Boolean functions, it has wide applications in a lot of areas, such as computer science, circuit design and test. The size of binary decision diagram depends on the variable ordering which is used. A new approach is presented in this paper for the variable ordering and the optimization of binary decision diagrams, t...
متن کاملAn Improved Algorithm for Network Reliability Evaluation
Binary Decision Diagram (BDD) is a data structure proved to be compact in representation and efficient in manipulation of Boolean formulas. Using Binary decision diagram in network reliability analysis has already been investigated by some researchers. In this paper we show how an exact algorithm for network reliability can be improved and implemented efficiently by using CUDD - Colorado Univer...
متن کاملRatio Cut Hypergraph Partitioning Using Bdd Based Mboa Optimization Algorithm
This paper deals with the k-way ratio cut hypergraph partitioning utilizing the Mixed discrete continuous variant of the Bayesian Optimization Algorithm (mBOA). We have tested our algorithm on three partitioning taxonomies: recursive minimum ratio cut, multi-way minimum ratio cut and recursive minimum cut bisection. We have also derived a new approach for modeling of Boolean functions using bin...
متن کاملAnalytical evaluation of an innovative decision-making algorithm for VM live migration
In order to achieve the virtual machines live migration, the two "pre-copy" and "post-copy" strategies are presented. Each of these strategies, depending on the operating conditions of the machine, may perform better than the other. In this article, a new algorithm is presented that automatically decides how the virtual machine live migration takes place. In this approach, the virtual machine m...
متن کامل